<!DOCTYPE HTML PUBLIC "-//IETF//DTD HTML 2.0//EN">
<html><head>
<meta http-equiv="content-type" content="text/html; charset=UTF-8">
<!--Converted with LaTeX2HTML 96.1 (Feb 5, 1996) by Nikos Drakos (nikos@cbl.leeds.ac.uk), CBLU, University of Leeds -->


<title>Marvelous Mazes</title>
<meta name="description" content="Marvelous Mazes">
<meta name="keywords" content="htmlatex">
<meta name="resource-type" content="document">
<meta name="distribution" content="global">
<link rel="STYLESHEET" href="acm-00445_files/htmlatex.css">
</head><body bgcolor="#ffffff" lang="EN">
 <h1><br clear="all"><center><table bgcolor="#0060f0"><tbody><tr><td><b><font color="#c0ffff" size="5">&nbsp;<a name="SECTION0001000000000000000000">Marvelous Mazes</a></font>&nbsp;</b></td></tr></tbody></table></center></h1>
<p>
Your mission, if you decide to accept it, is to create a maze
drawing program.  A maze will consist of the alphabetic
characters <tt>A-Z</tt>, <tt>*</tt> (asterisk), and spaces.
</p><p>
</p><h2><font color="#0070e8"><a name="SECTION0001001000000000000000">Input and Output</a></font></h2>
<p>
Your program will get
the information for the mazes from the input file.  This file
will contain lines of characters which your program must
interpret to draw a maze.  Each row of the maze will be described
by a series of numbers and characters, where the numbers before a
character tell how many times that character will be used.  If
there are multiple digits in a number before a character, then
the number of times to repeat the character is the sum of the
digits before that character.
</p><p>
The lowercase letter "<tt>b</tt>" will be
used in the input file to represent spaces in the maze.  The
descriptions for different rows in the maze will be separated by
an exclamation point (<tt>!</tt>) or by an end of line.
</p><p>
</p><p>
Descriptions for
different mazes will be separated by a blank line in both input and output.  The input
file will be terminated by an end of file.
</p><p>
There is no limit to
the number of rows in a maze or the number of mazes in a file,
though no row will contain more than 132 characters.
</p><p>
Happy mazing!
</p><p>
</p><h2><font color="#0070e8"><a name="SECTION0001002000000000000000">Sample Input</a></font></h2>
<p>
</p><pre>1T1b5T!1T2b1T1b2T!1T1b1T2b2T!1T3b1T1b1T!3T3b1T!1T3b1T1b1T!5T1*1T
 
11X21b1X
4X1b1X</pre>
<p>
</p><h2><font color="#0070e8"><a name="SECTION0001003000000000000000">Sample Output</a></font></h2>
<p>
</p><pre>T TTTTT
T  T TT
T T  TT
T   T T
TTT   T
T   T T
TTTTT*T
 
XX   X
XXXX X</pre>
<p>
</p></body></html>